Disjoint pairs in set systems with restricted intersection
نویسندگان
چکیده
منابع مشابه
Incongruent restricted disjoint covering systems
We define a restricted disjoint covering system on [1, n] as a set of congruence classes such that each integer in the interval [1, n] belongs to exactly one class, and each class contains at least two members of the interval. In this paper we report some computational and structural results and present some open problems concerning such systems.
متن کاملDisjoint, Partition and Intersection Constraints for Set and Multiset Variables
We have started a systematic study of global constraints on set and multiset variables. We consider here disjoint, partition, and intersection constraints. These global constraints fall into one of three classes. In the first class, we show that we can decompose the constraint without hindering bound consistency. No new algorithms therefore need be developed for such constraints. In the second ...
متن کاملDisjoint NP-Pairs from Propositional Proof Systems
For a proof system P we introduce the complexity class DNPP(P ) of all disjoint NP-pairs for which the disjointness of the pair is efficiently provable in the proof system P . We exhibit structural properties of proof systems which make the previously defined canonical NP-pairs of these proof systems hard or complete for DNPP(P ). Moreover we demonstrate that non-equivalent proof systems can ha...
متن کاملSet Systems with No Singleton Intersection
Let F be a k-uniform set system defined on a ground set of size n with no singleton intersection; i.e., no pair A,B ∈ F has |A ∩ B| = 1. Frankl showed that |F| ≤ (n−2 k−2 ) for k ≥ 4 and n sufficiently large, confirming a conjecture of Erdős and Sós. We determine the maximum size of F for k = 4 and all n, and also establish a stability result for general k, showing that any F with size asymptot...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2020
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2019.102998